Some remarks and questions about the AKS algorithm and related conjecture
نویسنده
چکیده
We show that AKS-algorithm for primality testing ( see [1]) can be modified to run in Õ(log n) time. We present some remarks and ask two questions related to this algorithm.
منابع مشابه
Remarks on AKS Primality Testing Algorithm and A Flaw in the Definition of P
We remark that the AKS primality testing algorithm [Annals of Mathematics 160 (2), 2004] needs about 1,000,000,000 G (gigabyte) storage space for a number of 1024 bits. The requirement is very hard to meet. The complexity class P which contains all decision problems that can be solved by a deterministic Turing machine using a polynomial amount of computation time, is generally believed to be “e...
متن کاملSOME REMARKS ON GENERALIZATIONS OF MULTIPLICATIVELY CLOSED SUBSETS
Let R be a commutative ring with identity and Mbe a unitary R-module. In this paper we generalize the conceptmultiplicatively closed subset of R and we study some propertiesof these genaralized subsets of M. Among the many results in thispaper, we generalize some well-known theorems about multiplicativelyclosed subsets of R to these generalized subsets of M. Alsowe show that some other well-kno...
متن کاملContent Analysis of the Concept of Addiction in High School Textbooks of Iran
Background: This research sought to determine how well the causes of addiction, addiction harms, and prevention of addiction have been noticed in high school textbooks.Methods: We used descriptive method to select the main related components of the addiction concept and content analysis method for analyzing the content of textbooks. The study population comprised 61 secondary school curriculum ...
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملA Note On the Storage Requirement for AKS Primality Testing Algorithm
We remark that AKS primality testing algorithm needs about 1,000,000,000 G (gigabyte) storage space for a number of 1024 bits. Such storage requirement is hard to meet in practice. To the best of our knowledge, it is impossible for current operating systems to write and read data in so huge storage space. Thus, the running time for AKS algorithm should not be simply estimated as usual in terms ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002